Local correctability of expander codes

Local Correctability of Expander Codes

In this work, we present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the codeword can be recovered with high probability by reading N symbols from the corrupted codeword, where N is the block-length of the code. Expander codes, introduce...

Expander Codes

We present a new class of asymptotically good, linear error-correcting codes based upon expander graphs. These codes have linear time sequential decoding algorithms , logarithmic time parallel decoding algorithms with a linear number of processors, and are simple to understand. We present both randomized and explicit constructions for some of these codes. Experimental results demonstrate the ex...

On expander codes

Expander codes count among the numerous applications of expander graphs. The term was first coined by Sipser and Spielman when they showed how expander graphs can be used to devise error-correcting codes with large blocklengths that can correct efficiently a constant fraction of errors. This approach has since proved to be a fertile avenue of research that provides insight both into modern iter...

Expander Chunked Codes

Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks and derive some basic prop...

On Expander Codes